Solving The Welch-Berlekamp Key Equation Over A Galois Ring
نویسنده
چکیده
– The Welch-Berlekamp (WB) key equation arises in the decoding of Reed-Solomon (RS) codes over finite fields where the decoding problem is viewed as a rational interpolation problem. The significance of this decoding approach lies in the fact that it does not require the prior evaluation of power sum symmetric functions, i.e. the so-called syndrome vector corresponding to a received word. It has recently been shown that RS codes over Zq, q a prime power, can also be decoded in the same way as their field counterparts. The purpose of this paper is therefore to present a generalization of a WB-type algorithm for solving the key equation over a Galois ring. Key-Words: – Rational interpolation, Reed-Solomon codes, Welch-Berlekamp key equation, Galois rings.
منابع مشابه
Efficient Decoding Of Reed-Solomon Codes Over Z q Based On Remainder Polynomials
– In 1983, Welch, L.R. and Berlekamp, E.R. introduced a new key equation based on rational interpolation for algebraically decoding Reed-Solomon (RS) codes over finite fields. A key feature of their so-called remainder decoding approach is that the computation of the syndrome vector corresponding to a given received word is not needed. For long codes, this implies significant computational savi...
متن کاملFrom the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm
The twoprimary decoding algorithms forReed-Solomon codes are the Berlekamp-Massey algorithm and the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.
متن کاملAlternating group coverings of the affine line for characteristic two
Unramified coverings of the affine line in characteristic two are constructed having alternating groups as Galois groups. The proof uses Jacobson’s criterion for the Galois group of an equation to be contained in the alternating group. Alternative proofs use the Berlekamp discriminant or the Revoy discriminant. These are related to the Arf invariant.
متن کاملThe Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithmand the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of the key equation and a newway to use the Euclidean algorithm to solve it are presented, which yield the Berlekamp-Massey algorithm. This results in a new, simpl...
متن کاملOn Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings
In this paper we study generalized Reed-Solomon codes (GRS codes) over commutative, noncommutative rings, show that the classical Welch-Berlekamp and Guruswami-Sudan decoding algorithms still hold in this context and we investigate their complexities. Under some hypothesis, the study of noncommutative generalized Reed-Solomon codes over finite rings leads to the fact that GRS code over commutat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002